Complete Boolean algebra - PDFSEARCH.IO - Document Search Engine

Complete Boolean algebra
Results: 108

#	Item
51	Reasoning about A c t i o n in Polynomial T i m e T h o m a s D r a k e n g r e n and M a r c u s B j a r e l a n d Department of Computer and Information Science Link6ping University, S[removed]Linkoping, Sweden email: { Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-01-24 05:33:24 Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation P-complete Temporal logic Frame problem Cook–Levin theorem Theoretical computer science Applied mathematics Mathematics
52	Microsoft Word - iwls07-final.doc Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2007-05-01 11:44:52 Boolean algebra Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean satisfiability problem Binary decision diagram Functional dependency Conjunctive normal form Theoretical computer science Mathematics Mathematical logic
53	The Local Lemma is tight for SAT∗ H. Gebauer †, T. Szab´o ‡, G. Tardos § Abstract Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2013-09-26 08:48:45 NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Hypergraph Unsatisfiable core Exponential time hypothesis MAX-3SAT Theoretical computer science Mathematics Applied mathematics
54	The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications Robert A. Hearn1 and Erik D. Demaine2 1 Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2002-07-31 20:05:58 Complexity classes Logic gates Finite model theory Boolean algebra True quantified Boolean formula Flip-flop PSPACE-complete FO IP Theoretical computer science Computational complexity theory Applied mathematics
55	Synthesizing Safe Bit-Precise Invariants? Arie Gurfinkel, Anton Belov and Joao Marques-Silva Abstract. Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in Add to Reading List Source URL: anton.belov-mcdowell.com Language: English - Date: 2014-01-27 10:25:19 Propositional calculus Boolean algebra Electronic design automation Logic in computer science NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories Well-formed formula Unsatisfiable core Logic Theoretical computer science Mathematical logic
56	Logic and Lattices for Distributed Programming Neil Conway William R. Marczak Peter Alvaro Add to Reading List Source URL: db.cs.berkeley.edu Language: English - Date: 2012-10-15 03:54:42 Lattice theory Algebra Order theory Lattice Monotonic function Boolean algebra Semilattice Complete Heyting algebra Complete lattice Abstract algebra Mathematics Algebraic structures
57	JID:APAL AID:2228 /FLA [m3G; v 1.68; Prn:[removed]; 12:41] P[removed]) Add to Reading List Source URL: philosophy.columbia.edu Language: English - Date: 2012-07-26 09:11:58 Boolean algebra Support Borel measure Null set Measure Borel set Complete Boolean algebra Abelian von Neumann algebra Trivial measure Mathematical analysis Mathematics Measure theory
58	An Introduction to Boolean Satisfiability Ian Blumenfeld CyberPoint International 14 May 2013 Add to Reading List Source URL: www.cyber.umd.edu Language: English - Date: 2013-05-18 03:11:56 Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean algebra Boolean satisfiability problem Field-programmable gate array Elliptic curve Diffie–Hellman Xilinx Theoretical computer science Electronic engineering Applied mathematics
59	Under consideration for publication in Theory and Practice of Logic Programming 1 Logic Programming with Satisfiability MICHAEL CODISH Add to Reading List Source URL: www.cs.bgu.ac.il Language: English - Date: 2008-06-25 01:40:23 Boolean algebra Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Boolean satisfiability problem Prolog Propositional variable Rewriting Theoretical computer science Logic Mathematical logic
60	Lazy Decomposition for Distributed Decision Procedures Youssef Hamadi Joao Marques-Silva Christoph M. Wintersteiger Add to Reading List Source URL: www.winterstiger.at Language: English - Date: 2011-11-25 16:24:02 Mathematical logic Logic in computer science NP-complete problems Boolean algebra Electronic design automation Boolean satisfiability problem Craig interpolation Conjunctive normal form Interpolation Theoretical computer science Mathematics Logic

UPDATE